An Element-Based Concurrent Partitioned for Unstructured Finite Element Meshes

نویسندگان

  • Hong Q. Ding
  • Robert D. Ferraro
چکیده

A concurrent partilionerforpartitioning Unstructured finite element meshes on distributed memory architectures is developed. The partitioned uses an element-based partitioning strategy 1[s main advantage over the more conventional node-based partitioning strategy is its modular programing approach to the development of parallel applications. The partitionerfirst partitions element centroids ioing a recursive inertial bisection algorithm. Elements and nodes then migrate according to the pw-titioned centroids, using a data request communication template for unpredictable incoming messages. Our scalable implementation is contrasted to a non-scalable implementation which is a straightforward parallelization of a sequential partitioned. 1’Yw algorithms adopted in the partitioned scale logarithmically, as confirmed by actual timing measurements on the Intel Delta on up to 512 processorsfor scaled size problems..

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Slices: A Scalable Partitioner for Finite Element Meshes

A pasallcl partitioned for partitioning unstructured finite element meshes on distributed memory architectures is developed. The, element based partitioned can handle mixtures of different element types. All algoritlnns adopted in the partitioned are scalable, including a communication template for ullpredictable incoming messages, as shown in actual timing measurements.

متن کامل

An Element-Based Concurrent Partitioner for Unstructured Finite Element Meshes

Ding & Ferraro 1 Abstract. A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning strategy. Its main advantage over the more conventional node-based partitioning strategy is its modular programing approach to the development of parallel applications. The partitioner first p...

متن کامل

OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS

In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...

متن کامل

A Domain Decomposition Preconditioner for a Parallel Finite Element Solver on Distributed Unstructured Grids

We consider a number of practical issues associated with the parallel distributed memory solution of elliptic partial diierential equations using unstructured meshes in two dimensions. The rst part of the paper describes a parallel mesh generation algorithm which is designed both for eeciency and to produce a well-partitioned, distributed mesh, suitable for the eecient parallel solution of an e...

متن کامل

FEMAG: A High Performance Parallel Finite Element Toolbox for Electromagnetic Computations

This paper presents a parallel finite element toolbox for computing large electromagnetic devices on unstructured tetrahedral meshes, FEMAG—Fem for ElectroMagnetics on Adaptive Grids. The finite element toolbox deals with unstructured tetrahedral meshes and can solve electromagnetic eddy current problems in both frequency domain and time domain. It adopts high-order edge element methods and ref...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997